Invariant recurrence relations for {{{\mathbb C}}P^{N-1}} models

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Finite size scaling in CPN-1 models.

Finite size effects in Euclidean CP models with periodic boundary conditions are investigated by means of the 1/N expansion and by Monte Carlo simulations. Analytic and numerical results for magnetic susceptibility and correlation length are compared and found to agree for small volumes. For large volumes a discrepancy is found and explained as an effect of the physical bound state extension. T...

متن کامل

CPN−1 Models at a Lifshitz Point

We consider CPN−1 models in d+1 dimensions around Lifshitz fixed points with dynamical critical exponent z, in the large-N expansion. It is shown that these models are asymptocially free and dynamically generate a mass for the CPN−1 fields for all d = z. We demonstrate that, for z = d = 2, the initially nondynamical gauge field acquires kinetic terms in a way similar to usual CPN−1 models in 1 ...

متن کامل

RECURRENCE RELATIONS , FRACTALS , AND CHAOS 1 Recurrence Relations , Fractals , and Chaos : Implications for Analyzing Gene Structure

The " chaos game " is a well-known algorithm by which one may construct a pictorial representation of an iterative process. The resulting sets are known as fractals and can be mathematically characterized by measures of dimension as well as by their associated recurrence relations. Using the chaos game algorithm, is it possible to derive meaningful structure out of our own genetic encoding, and...

متن کامل

Hermite-Hadamard inequalities for $mathbb{B}$-convex and $mathbb{B}^{-1}$-convex functions

Hermite-Hadamard inequality is one of the fundamental applications of convex functions in Theory of Inequality. In this paper, Hermite-Hadamard inequalities for $mathbb{B}$-convex and $mathbb{B}^{-1}$-convex functions are proven.

متن کامل

1 Order Invariant Relations and Incompleteness

Every order invariant subset of Q[0,n] has a maximal square whose sections at any (i,...,n1),(i+1,...,n) agree below i. Every order invariant graph on Q[0,n] has a maximal clique whose sections at any (i,...,n-1),(i+1,...,n) agree below i. We prove these and closely related statements, including a finite form, in extensions of the usual ZFC axioms for mathematics with standard large cardinal hy...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Physics A: Mathematical and Theoretical

سال: 2010

ISSN: 1751-8113,1751-8121

DOI: 10.1088/1751-8113/43/26/265206